In this paper, we perform theoretical analysis and experiments on the Simplex Crossover (SPX), which we have proposed. Real-coded GAs are expected to be a powerful function optimization technique for real-world applications where it is often hard to formulate the objective function. However, we believe there are two problems which will make such applications difficult; 1) performance of real-coded GAs depends on the coordinate system used to express the objective function, and 2) it costs much labor to adjust parameters so (...) that the GAs always find an optimum point efficiently. The result of our theoretical analysis and experiments shows that a performance of SPX is independent of linear coordinate transformation and that SPX always optimizes various test function efficiently when theoretical value for expansion rate, which is a parameter of SPX, is applied. We also show that BLX-α is equivalent to degenerate form of SPX. Experiments show that we have something misunderstood effect of epistasis on performance degradation of real-coded GAs. (shrink)

In this paper, we propose the c AS, a new ACO algorithm, and evaluate the performance using TSP instances available at TSPLIB. The results show that c AS works well on the test instances and has performance that may be one of the most promising ACO algorithms. We also evaluate c AS when it is combined with LK local search heuristic using larger sized TSP instances. The results also show promising performance. c AS introduced two important schemes. One is to (...) use the colony model divided into units, which has a stronger exploitation feature while maintaining a certain degree of diversity among units. The other is to use a scheme, we call cunning, when constructing new solutions, which can prevent premature stagnation by reducing strong positive feedback to the trail density. (shrink)

We propose protein localization dependent signal activation (PLDSA) as a model to describe pre‐existing protein partitioning between the cytosol, and membrane surface, as a means to modulate signal activation, specificity, and robustness. We apply PLDSA to explain possible molecular links between type II diabetes mellitus (T2DM) and Alzheimer's disease (AD) by describing Ca+2‐mediated interactions between the Src non‐receptor tyrosine kinase and p52Shc adaptor protein. We suggest that these interactions may serve as a contributing factor to disease development and progression. In (...) particular, we propose that signaling response is regulated, in part, by Ca+2‐mediated partitioning of lipid‐bound and soluble forms of Src and p52shc. Thus, protein‐protein interactions that drive signaling in response to extracellular ligand binding are also mediated by partitioning of signaling proteins between membrane‐bound and soluble populations. We propose that PLDSA effects may explain, in part, the evolutionary basis of promiscuous protein interaction domains and their importance in cellular function. (shrink)

This article studies the treatment effect models in which individuals are classified into unobserved groups based on heterogeneous treatment rules. By using a finite mixture approach, we propose a marginal treatment effect framework in which the treatment choice and outcome equations can be heterogeneous across groups. Under the availability of instrumental variables specific to each group, we show that the MTE for each group can be separately identified. On the basis of our identification result, we propose a two-step semiparametric procedure (...) for estimating the group-wise MTE. We illustrate the usefulness of the proposed method with an application to economic returns to college education. (shrink)

ナショナリズムと親和的関係にある日本通史への欲望を拒否するために、山崎闇斎学派や武士道の語りにおけるナショナルな視線を相対化し、他者性を帯びた「江戸」の自国意識や対中国認識に注目することで、歴史の断面 を記述することの可能性を探る。.

いま、この危機と混迷の時代に、憲法学者・樋口陽一が、基本に立ち戻り、戦後日本を代表する英知・加藤周一と丸山眞男の「憲法論」と「思想」を再読し、その本質を語り尽くす。.

Let f be a computable function from finite sequences of 0ʼs and 1ʼs to real numbers. We prove that strong f-randomness implies strong f-randomness relative to a PA-degree. We also prove: if X is strongly f-random and Turing reducible to Y where Y is Martin-Löf random relative to Z, then X is strongly f-random relative to Z. In addition, we prove analogous propagation results for other notions of partial randomness, including non-K-triviality and autocomplexity. We prove that f-randomness relative to a (...) PA-degree implies strong f-randomness, hence f-randomness does not imply f-randomness relative to a PA-degree. (shrink)

We consider weak theories of concatenation, that is, theories for strings or texts. We prove that the theory of concatenation WTC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}^{-\varepsilon}}$$\end{document}, which is a weak subtheory of Grzegorczyk’s theory TC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{TC}^{-\varepsilon}}$$\end{document}, is a minimal essentially undecidable theory, that is, the theory WTC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}^{-\varepsilon}}$$\end{document} is essentially undecidable and if one omits an axiom scheme from WTC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} (...) \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}^{-\varepsilon}}$$\end{document}, then the resulting theory is no longer essentially undecidable. Moreover, we give a positive answer to Grzegorczyk and Zdanowski’s conjecture that ‘The theory TC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{TC}^{-\varepsilon}}$$\end{document} is a minimal essentially undecidable theory’. For the alternative theories WTC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}}$$\end{document} and TC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{TC}}$$\end{document} which have the empty string, we also prove that the each theory without the neutrality of ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varepsilon}$$\end{document} is to be such a theory too. (shrink)

Every computable function has to be continuous. To develop computability theory of discontinuous functions, we study low levels of the arithmetical hierarchy of nonuniformly computable functions on Baire space. First, we classify nonuniformly computable functions on Baire space from the viewpoint of learning theory and piecewise computability. For instance, we show that mind-change-bounded learnability is equivalent to finite View the MathML source2-piecewise computability 2 denotes the difference of two View the MathML sourceΠ10 sets), error-bounded learnability is equivalent to finite View (...) the MathML sourceΔ20-piecewise computability, and learnability is equivalent to countable View the MathML sourceΠ10-piecewise computability . Second, we introduce disjunction-like operations such as the coproduct based on BHK-like interpretations, and then, we see that these operations induce Galois connections between the Medvedev degree structure and associated Medvedev/ Muchnik-like degree structures. Finally, we interpret these results in the context of the Weihrauch degrees and Wadge-like games. (shrink)

This study investigates the individual outcomes of irrational thinking, including belief in the paranormal and non-scientific thinking. These modes of thinking are identified through factor analysis of eleven questions asked in a large-scale survey conducted in Japan in 2008. Income and happiness are used as measures of individual performance. We propose two hypotheses. Previous studies in finance lead us to consider Hypothesis 1 that both higher belief in the paranormal and non-scientific thinking are associated with lower income. Literature on the (...) association between religion, the paranormal, and happiness suggest Hypothesis 2 that higher belief in the paranormal is associated with greater happiness, while higher non-scientific thinking is associated with greater unhappiness. To examine these hypotheses, we regress income and happiness on belief in the paranormal and non-scientific thinking with appropriate control variables. We employ the Mincer-type wage function as the income equation. Income, sex, and age are controlled in the happiness equation. Analysis supports both hypotheses, which highlights the complex features of irrationality. Although irrationality results in diminishing financial profitability, the component of belief in the paranormal improves the psychological state. (shrink)

It is known that infinitely many Medvedev degrees exist inside the Muchnik degree of any nontrivial Π10 subset of Cantor space. We shed light on the fine structures inside these Muchnik degrees related to learnability and piecewise computability. As for nonempty Π10 subsets of Cantor space, we show the existence of a finite-Δ20-piecewise degree containing infinitely many finite-2-piecewise degrees, and a finite-2-piecewise degree containing infinitely many finite-Δ20-piecewise degrees 2 denotes the difference of two Πn0 sets), whereas the greatest degrees in (...) these three “finite-Γ-piecewise” degree structures coincide. Moreover, as for nonempty Π10 subsets of Cantor space, we also show that every nonzero finite-2-piecewise degree includes infinitely many Medvedev degrees, every nonzero countable-Δ20-piecewise degree includes infinitely many finite-piecewise degrees, every nonzero finite-2-countable-Δ20-piecewise degree includes infinitely many countable-Δ20-piecewise degrees, and every nonzero Muchnik degree includes infinitely many finite-2-countable-Δ20-piecewise degrees. Indeed, we show that any nonzero Medvedev degree and nonzero countable-Δ20-piecewise degree of a nonempty Π10 subset of Cantor space have the strong anticupping properties. Finally, we obtain an elementary difference between the Medvedev degree structure and the finite-Γ-piecewise degree structure of all subsets of Baire space by showing that none of the finite-Γ-piecewise structures is Brouwerian, where Γ is any of the Wadge classes mentioned above. (shrink)

From an institutional perspective we contribute to corporate governance of firms by (1) proposing a procedurally fair mechanism that is ethically desirable, and (2) experimentally testing whether procedural fairness crowds-in ethical behavior of managers (on behalf of shareholders) and workers. The experiment sees one ‘manager’ and three ‘workers’ (possibly representing three sections of the firm) co-determining an efficiency-enhancing investment which could harm some workers. Firstly, the manager claims a share of the investment surplus, then workers ‘bid’ for the investment to (...) express their willingness to satisfy the manager’s claim in case the investment is implemented. If the sum of workers’ bids is less than the manager’s claim, the investment is not implementable, which means its surplus will be lost. Workers’ behavior is ‘ethical’ when they veto unfair managerial claims, because the workers have to sacrifice own earnings. Hence, a manager’s fair claim is the ethical response to the threat of workers’ veto. If the manager claims fairly, workers’ ethical behavior is to ‘truthfully’ bid their investment evaluations; by all doing so, they equally share whatever surplus the manager has left for them. The experimental results show ethical behavior of managers in the form of fair claims. Despite these fair claims, workers behave less ethically by strategically underbidding. So the procedurally fair mechanism only partially crowds-in ethical behavior. This study should interest theorists of stakeholder management, especially those engaged in designing the rules of corporate governance. (shrink)

Probably very few people today would believe that, prior to Japan's modernization during the Meiji period, the Japanese were not able to run. It seems commonsensical that human beings should be able to perform the same body movements such as running—since, of course, we are human beings regardless of whether we live in modern countries. However, it appears, in fact, that people in the Edo Period did not run in the sense of how we run today. There was no need, (...) for example, for farmers to run in the midst of their daily agricultural activities.In addition, it has been also pointed out that, although some premodern Japanese, such as samurai or official messengers... (shrink)

To compare two randomness notions with each other, we ask whether a given randomness notion can be defined via another randomness notion. Inspired by Yu's pioneering study, we formalize our question using the concept of relativization of randomness. We give some solutions to our formalized questions. Also, our results include the affirmative answer to the problem asked by Yu in a discussion with the second author, i.e., whether Schnorr randomness relative to the halting problem is equivalent to Martin‐Löf randomness relative (...) to all low 1‐generic reals. (shrink)

This paper explores the psychological motivations behind collectivist behavior in Japan and the U.S. Using data from a large-scale questionnaire survey, we examine the causes of collectivist behavior (i.e., group conformity) at workplaces and at home. Our key findings are as follows: (i) in Japan, people conform to their groups, both at work and at home, because they consider that cooperation with others will result in greater achievement; (ii) in both Japan and the U.S., people conform to their groups, both (...) at work and at home, because behaving similarly to others makes them feel comfortable; and (iii) in both Japan and the U.S., people conform to their family’s opinion at home because they value cooperation with family members. Our findings suggest that institutional differences between Japan and the U.S. give rise to the differences in psychological motivations for collectivist behavior. (shrink)

私たちは、暴力的な存在なのか?人間にとって、暴力とは何か?その不可避性と、回避/克服の可能性をともに見すえつつ思考をつむぐ、「暴力の哲学/倫理学」の試み。.

Kierstead showed that every computable marriage problem has a computable matching under the assumption of computable expanding Hall condition and computable local finiteness for boys and girls. The strength of the marriage theorem reaches or if computable expanding Hall condition or computable local finiteness for girls is weakened. In contrast, the provability of the marriage theorem is maintained in even if local finiteness for boys is completely removed. Using these conditions, we classify the strength of variants of marriage theorems in (...) the context of reverse mathematics. Furthermore, we introduce another condition that also makes the marriage theorem provable in, and investigate the sequential and Weihrauch strength of marriage theorems under that condition. (shrink)

We clarify the significance of quasiprobability in quantum mechanics that is relevant in describing physical quantities associated with a transition process. Our basic quantity is Aharonov’s weak value, from which the QP can be defined up to a certain ambiguity parameterized by a complex number. Unlike the conventional probability, the QP allows us to treat two noncommuting observables consistently, and this is utilized to embed the QP in Bohmian mechanics such that its equivalence to quantum mechanics becomes more transparent. We (...) also show that, with the help of the QP, Bohmian mechanics can be recognized as an ontological model with a certain type of contextuality. (shrink)

The number of competing-brands changes by new product's entry. The new product introduction is endemic among consumer packaged goods firm and is an integral component of their marketing strategy. As a new product's entry affects markets, there is a pressing need to develop market response model that can adapt to such changes. In this paper, we develop a dynamic model that capture the underlying evolution of the buying behavior associated with the new product. This extends an application of a dynamic (...) linear model, which is used by a number of time series analyses, by allowing the observed dimension to change at some point in time. Our model copes with a problem that dynamic environments entail: changes in parameter over time and changes in the observed dimension. We formulate the model with framework of a state space model. We realize an estimation of the model using modified Kalman filter/fixed interval smoother. We find that new product's entry (1) decreases brand differentiation for existing brands, as indicated by decreasing difference between cross-price elasticities; (2) decreases commodity power for existing brands, as indicated by decreasing trend; and (3) decreases the effect of discount for existing brands, as indicated by a decrease in the magnitude of own-brand price elasticities. The proposed framework is directly applicable to other fields in which the observed dimension might be change, such as economic, bioinformatics, and so forth. (shrink)